Measuring Index Quality Using Random Walks on the Web
نویسندگان
چکیده
Recent research has studied how to measure the size of a search engine, in terms of the number of pages indexed. In this paper, we consider a di erent measure for search engines, namely the quality of the pages in a search engine index. We provide a simple, e ective algorithm for approximating the quality of an index by performing a random walk on the Web, and we use this methodology to compare the index quality of several major search engines.
منابع مشابه
Exceptional Times for the Dynamical Discrete Web
The dynamical discrete web (DyDW), introduced in recent work of Howitt and Warren, is a system of coalescing simple symmetric one-dimensional random walks which evolve in an extra continuous dynamical time parameter τ . The evolution is by independent updating of the underlying Bernoulli variables indexed by discrete space-time that define the discrete web at any fixed τ . In this paper, we stu...
متن کاملبررسی وضعیت خود استنادی نویسندگان پرکار ایرانی در حوزه پزشکی و تاثیر آن بر شاخص هرش آنها در پایگاه Web of Science
Background and Aim: Using Hirsch index as an important tool to describe the scientific outputs of researchers has caused some authors to increase their self-imposed parameters, increase, citing themselves. Therefore it is necessary to consider the effect of self-citation on Hirsch index for every author to have better measuring on the quality of researchers scientific production. Materials and...
متن کاملWIT: Web People Search Disambiguation using Random Walks
In this paper, we describe our work on a random walks-based approach to disambiguating people in web search results, and the implementation of a system that supports such approach, which we used to participate at Semeval’07 Web People Search task.
متن کاملA PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملThe Dynamical Discrete Web
The dynamical discrete web (DDW), introduced in recent work of Howitt and Warren, is a system of coalescing simple symmetric one-dimensional random walks which evolve in an extra continuous dynamical time parameter s. The evolution is by independent updating of the underlying Bernoulli variables indexed by discrete space-time that define the discrete web at any fixed s. In this paper, we study ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Networks
دوره 31 شماره
صفحات -
تاریخ انتشار 1999